Approximate optimality with bounded regret in dynamic matching models
نویسندگان
چکیده
منابع مشابه
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to miss occurrences with probability . This is particularly appropriate for this problem, as approximate searching is used to model many cases where exact answers are not mandatory. We show that the relaxed version of the pr...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملDynamic and Approximate Pattern Matching in 2D
We consider dynamic and online variants of 2D pattern matching between an m×m pattern and an n× n text. All the algorithms we give are randomised and give correct outputs with at least constant probability. – For dynamic 2D exact matching where updates change individual symbols in the text, we show updates can be performed in O(log n) time and queries in O(log m) time. – We then consider a mode...
متن کاملRegret Matching with Finite Memory
We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that does not contain a smaller product set that is closed under “same or better replies,” i.e., a smaller PC...
متن کاملRegret-Matching Bounds Bounds for Regret-Matching Algorithms
We study a general class of learning algorithms, which we call regret-matching algorithms, along with a general framework for analyzing their performance in online (sequential) decision problems (ODPs). In each round of an ODP, an agent chooses a probabilistic action and receives a reward. The particular reward function that applies at any given round is not revealed until after the agent acts....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2015
ISSN: 0163-5999
DOI: 10.1145/2825236.2825265